binary search
英 [ˈbaɪnəri sɜːtʃ]
美 [ˈbaɪnəri sɜːrtʃ]
对分查找；二进位检索；折半查找法；二分搜寻
双语例句
- It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。 - Red-black tree is a self-balancing binary search tree.
红黑树是一个自平衡的二叉查找树。 - We started off talking about binary search, and I suggested that this was a log algorithm which it is, which is really kind of nice.
我告诉了你们这是一个对，数级的算法，这是很棒的，我们来一起看看这个算法到底做了什么。 - RFID binary search algorithm to achieve improvement and anti-collision
RFID二进制搜索算法的改进及其防碰撞实现 - Now, as I do this, I'm going to use binary search.
现在当我做这项工作的时候，我会用到二分搜索法。 - Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。 - Based on binary search, this paper proposes an efficient algorithm for finding a set of elementary siphons.
提出一种基于二分法搜索原理计算基本信标的高效算法。 - Now, one of the questions we could still ask is, right, we've got binary search, which has got this nice log behavior.
目前，还有一个问题我们仍然要问的是，对，我们已经学了二分查找，有着非常好的log级别的行为。 - At least wide receivers have to run, whereas I can guarantee you, without fear of contradiction, that no software engineer will ever have to write a binary search after they are hired.
因为至少接球员是需要跑的，而我却可以无所畏惧的向你保证，没有哪个被聘用的软件工程师必须写一个二分查找程序。 - An effective method of searching an ordered list of entries is the so-called binary search or logarithmic search method.
查几个登记项的有序表的一种有效方法就是所谓的折半查找或称对数查找。 - Improved RFID binary search anti-collision algorithm
改进的RFID二进制搜索防碰撞算法 - Study of Mine Personnel Tracking and Orientation System Based on Binary Search Algorithm
基于二进制搜索算法的矿井人员跟踪定位系统研究 - A design of sucrose-crystallizing particles classifier based on the decision tree for binary search
基于二分查找判定树的蔗糖结晶颗粒分类器设计 - OK. That's the basic idea of binary search.
好了，这就是二分查找的基本思想。 - Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
二分搜索算法，图形搜索算法，排序算法，以及基于树的搜索算法比如极大极小树，这些基本的算法或许也是重要的基础。 - A scapegoat tree is a self-balancing binary search tree, that provides worst-case O ( log n) lookup time, and O ( log n) amortized insertion and deletion time.
替罪羊树是一种自平衡的二分查找树，它提供了最坏情况下的O（logn）查找时间，以及O（logn）的分期插入和删除时间。 - Research and Realization of a New Improved Binary Search Algorithm
一种改进的新二分查找算法的研究与实现 - This idea of binary search is going to be a really powerful tool.
二分查找的思想，是一个非常有用的工具，我重复一遍，把问题拆成几部分来解决，那事实上，这里的增长率是多少？ - Owing to the improved binary search algorithm, 38% of transmission time was saved and the identification efficiency was greatly improved.
算法的改进使传输时间节省38%，大大提高了奶牛的识别效率。 - If the search is time-critical, a binary search or hash table lookup is almost always best, but as with sorting, you must keep locality in mind.
如果搜索是时间关键的，二进制搜索或者哈希表查找几乎总是最好的，但是与排序一样，必须记住地址。 - And the algorithms are just as important-from binary search to different sorts to graph traversals, a rockstar engineer must know and internalize the basics.
算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。 - An algorithm of packet classification based on binary search on levels
一种基于折半层次搜索的包分类算法 - The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree ( ACT) was proposed.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法（ACT）。 - Unlike other self-balancing binary search trees that provide worst case O ( log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。 - Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean?
好了，二分搜索也许是，最简单的分治算法，这意味着什么？ - In this paper, the binary search algorithm and some improved algorithms are compared and analyzed in detail, and the binary search algorithm for multi-state has been improved and innovative.
本文详细分析了典型的二进制及其他改进防碰撞算法原理，并在多状态二进制搜索算法的基础上进行了改进和创新。 - However, the binary search lookup table is a prerequisite for the data elements must be orderly.
但是，折半查找的先决条件是查找表中的数据元素必须有序。 - Moreover, the performance analysis shows that the algorithm has more obvious advantages than the binary search algorithm and the dynamic binary search algorithm.
性能分析表明，该算法比已有的二进制及动态二进制反碰撞算法具有更明显的优势。 - Binary search is an efficient search method.
折半查找是一种高效的查找方法。 - The instant unlike binary search, where each instance was separate, here the instances overlap.
这个例子不像搜索二进制数，每个例子是独立的，这里的例子是相互重叠的。